منابع مشابه
A 223 { Approximation Algorithm for the Shortest
Given a collection of strings S = fs 1 ; : : :; s n g over an alphabet , a superstring of S is a string containing each s i as a substring; that is, for each i, 1 i n, contains a block of js i j consecutive characters that match s i exactly. The shortest superstring problem is the problem of nding a superstring of minimum length. The shortest superstring problem has applications in both data co...
متن کاملA 2 2/3 Superstring Approximation Algorithm
Given a collection of strings S = fs 1 ; : : : ; s n g over an alphabet , a superstring of S is a string containing each s i as a substring; that is, for each i, 1 i n, contains a block of js i j consecutive characters that match s i exactly. The shortest superstring problem is the problem of nding a superstring of minimum length. The shortest superstring problem has applications in both data c...
متن کامل{Approximation Algorithm for the Shortest Superstring Problem
Given a collection of strings S = fs1; : : : ; sng over an alphabet , a superstring of S is a string containing each si as a substring; that is, for each i, 1 i n, contains a block of jsij consecutive characters that match si exactly. The shortest superstring problem is the problem of nding a superstring of minimum length. The shortest superstring problem has applications in both data compressi...
متن کاملApproximation Algorithm for the Shortest Approximate Common Superstring Problem
The Shortest Approximate Common Superstring (SACS) problem is : Given a set of strings f={w1, w2, ... , wn}, where no wi is an approximate substring of wj, i ≠ j, find a shortest string Sa, such that, every string of f is an approximate substring of Sa. When the number of the strings n>2, the SACS problem becomes NP-complete. In this paper, we present a greedy approximation SACS algorithm. Our ...
متن کاملA Tutorial on Shortest Superstring Approximation
This is a tutorial on approximation algorithms for the Shortest Superstring Problem (SSP). My intention when writing it was to provide the foundations for actually doing research on this topic. In Section 2 I cover the basic definitions and observations and introduce the ”Greedy Conjecture”. In Section 3 I describe the standard framework for approximating SSP based on a overlap-reducing transfo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1998
ISSN: 0166-218X
DOI: 10.1016/s0166-218x(98)00065-1